Approximating the Non-contiguous Multiple Organization Packing Problem
نویسندگان
چکیده
We present in this paper a 5/2-approximation algorithm for scheduling rigid jobs on multi-organizations. For a given set of n jobs, the goal is to construct a schedule for N organizations (composed each of m identical processors) minimizing the maximum completion time (makespan). This algorithm runs in O(n(N +log(n)) log(npmax)), where pmax is the maximum processing time of the jobs. It improves the best existing low cost approximation algorithms. Moreover, the proposed analysis can be extended to a more generic approach which suggests different job partitions that could lead to low cost approximation algorithms of ratio better than 5/2.
منابع مشابه
Scheduling algorithms for multiple channel wireless local area networks
This paper describes algorithms for scheduling traffic in wireless data networks with multiple channels per cell. The paper assumes that a reservation-based medium access control (MAC) protocol is used. The main objective of the scheduling algorithms is to reduce the computation time while maximizing the utilization of the network resources, thereby improving the system throughput. The scheduli...
متن کاملA New Model and Lower Bounds for Oriented Non- Guillotine Two-Dimensional Strip Packing
The oriented non-guillotine two-dimensional strip packing problem is investigated. Several 1D relaxations are considered and compared. Moreover, an ILP formulation of the 1D contiguous relaxation is given. The appropriate combination of some of the relaxations enables us the formulate a new ILP model of the strip packing problem.
متن کاملExtending Two-Dimensional Bin Packing Problem: Consideration of Priority for Items
In this paper a two-dimensional non-oriented guillotine bin packing problem is studied when items have different priorities. Our objective is to maximize the total profit which is total revenues minus costs of used bins and wasted area. A genetic algorithm is developed to solve this problem where a new coding scheme is introduced. To evaluate the performance of the proposed GA, first an upper b...
متن کاملOn the generalized bin packing problem
The Generalized Bin Packing Problem (GBPP) is a novel packing problem arising in many transportation and logistic settings, characterized by multiple item and bin attributes and by the joint presence of both compulsory and non-compulsory items. We introduce a change in the definition of the problem that does not impact either on its feasible solution set or on its optimal solutions, but guarant...
متن کاملScheduling and Packing Malleable Tasks with Precedence Constraints of Bounded Width
We study two related problems in non-preemptive scheduling and packing of malleable tasks with precedence constraints to minimize the makespan. We distinguish the scheduling variant, in which we allow the free choice of processors, and the packing variant, in which a task must be assigned to a contiguous subset of processors. For precedence constraints of bounded width, we completely resolve th...
متن کامل